package cn.michael.dev.data.structure.array;

/**
 * Created by hufenggang on 2021/9/9.
 */
public class Problem33 {

    public int search(int[] nums, int target) {

        if (nums.length == 0) {
            return -1;
        }

        // 查看数组旋转的下标
        int head = 0;
        int tail = nums.length - 1;
        int k = 0;
        while (nums[head] > nums[tail]) {
            k++;
        }

        return 0;
    }
}
